Streetnotes 21 Cover

CMSC 451 : Lecture 21 Clique , Vertex Cover , and Dominating Set Thursday , Nov 30 , 2017

Vertex Cover (VC): A vertex cover in an undirected graph G = (V,E) is a subset of vertices V ′ ⊆ V such that every edge in G has at least one endpoint in V ′. The vertex cover problem (VC) is: given an undirected graph G and an integer k, does G have a vertex cover of size k? Dominating Set (DS): A dominating set in a graph G = (V,E) is a subset of vertices V ′ such that every vertex in the gra...

cover

Geopersia is published biannually by the College of Science, University of Tehran, Iran. The College of Science published Journal of Science, which covered all fields of basic science, from 1968 to 2010. It was then decided that the College’s journals should be more specialized, and hence publication of Geopersia was launched. Articles printed in Geopersia will be available online too. Aims an...

cover

cover

cover

cover

Cover